Big O notation

Results: 335



#Item
171Computer science / Computational complexity theory / Time complexity / Big O notation / Algorithm / XTR / Mathematics / Applied mathematics / Analysis of algorithms

Breaking Symmetry with Agents of Different Speeds Evan Huus (Carleton University) [removed] April 3, 2013

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
172Applied mathematics / Mathematics / Operations research / Asymptotic analysis / Mathematical optimization / Big O notation / Theoretical computer science / Computational complexity theory / Analysis of algorithms

Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1

Add to Reading List

Source URL: tunnuz.net

Language: English - Date: 2014-09-12 00:58:22
173Analysis of algorithms / Computational complexity theory / Dynamic programming / Algorithm / Time complexity / Big O notation / Longest increasing subsequence / CYK algorithm / Theoretical computer science / Mathematics / Applied mathematics

SOI 2013 The Swiss Olympiad in Informatics Perfect solution

Add to Reading List

Source URL: www.soi.ch

Language: English - Date: 2012-09-30 17:37:36
174Quicksort / Bubble sort / Merge sort / Big O notation / Algorithm / Analysis of algorithms / Computational complexity theory / Adaptive sort / Insertion sort / Sorting algorithms / Mathematics / Order theory

Computer Science for the self-taught Hacker An introduction to CS theory

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
175Analysis of algorithms / Randomized algorithm / Big O notation / Time complexity / Expectation–maximization algorithm / Pseudo-random number sampling / Theoretical computer science / Mathematics / Applied mathematics

Random Sampling with a Reservoir JEFFREY SCOTT VITTER Brown University We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknown

Add to Reading List

Source URL: www.mathcs.emory.edu

Language: English - Date: 2005-10-15 23:23:14
176Arithmetic functions / Integer sequences / Prime number theorem / Chebyshev function / Big O notation / Exponentiation / Prime number / Riemann hypothesis / Prime gap / Mathematics / Mathematical analysis / Number theory

LOWER BOUNDS FOR THE PRINCIPAL GENUS OF DEFINITE BINARY QUADRATIC FORMS arXiv:0811.0358v2 [math.NT] 25 Oct[removed]KIMBERLY HOPKINS AND JEFFREY STOPPLE

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-02-23 21:39:50
177Function / Big O notation / Category / Sheaf / Closest pair of points problem / Mathematics / Mathematical analysis / Analysis of algorithms

A Fair Assignment Algorithm for Multiple Preference Queries Leong Hou U Nikos Mamoulis

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2009-07-27 10:29:02
178Finite fields / Analysis of algorithms / Asymptotic analysis / Cryptography / Analytic number theory / Elliptic curve / Ample line bundle / Big O notation / Hyperelliptic curve cryptography / Abstract algebra / Mathematics / Mathematical analysis

Relating the ECDLP to Other Curves Mark Bauer University of Calgary Department of Mathematics & Statistics Centre for Information Security and Cryptography

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2006-11-15 13:19:55
179Combinatorial optimization / NP-complete problems / Cut / Maximum flow problem / Graph embedding / Matching / Vertex cover / Big O notation / Graph coloring / Mathematics / Theoretical computer science / Graph theory

Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University SATISH RAO and UMESH VAZIRANI

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2013-09-11 13:19:18
180Computational complexity theory / Communication / Models of computation / Asymptotic analysis / Quantum information science / Michael Saks / Information theory / Decision tree model / Big O notation / Theoretical computer science / Applied mathematics / Mathematics

Lower Bounds for the Noisy Broadcast Problem Navin Goyal ∗ [removed] Dept. of Computer Science Rutgers University

Add to Reading List

Source URL: dimacs.rutgers.edu

Language: English - Date: 2006-03-28 19:38:19
UPDATE